The Euclidean distance degree of smooth complex projective varieties
نویسندگان
چکیده
منابع مشابه
The Euclidean Distance Degree of Smooth Complex Projective Varieties
We obtain several formulas for the Euclidean distance degree (ED degree) of an arbitrary nonsingular variety in projective space: in terms of Chern and Segre classes, Milnor classes, Chern-Schwartz-MacPherson classes, and an extremely simple formula equating the Euclidean distance degree of X with the Euler characteristic of an open subset of X.
متن کاملThe Euclidean Distance Degree of Orthogonally Invariant Matrix Varieties
We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in concrete circumstances.
متن کاملThe complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
We continue the study of counting complexity begun in [13, 14, 15] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the problem of computing the Hilbert polynomial of a smooth equidimensional complex projective variety can be reduced in polynomial time to the problem of counting the number of complex common zeros of a f...
متن کاملThe complexity of computing the Hilbert polynomial of smooth complex projective varieties
Despite the impressive progress in the development of algebraic algorithms and computer algebra packages, the inherent computational complexity of even the most basic problems in algebraic geometry is still far from being understood. In [5] a systematic study of the inherent complexity for computing algebraic/topological quantities was launched with the goal of characterizing the complexity of ...
متن کاملEuclidean Distance Degree for Chemical Reaction Networks
In this paper we investigate the complexity of model selection and model testing in chemical reaction networks by formulating them as Euclidean distance problems. We determine closed form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with arbitrarily many reaction sites. We show how our re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra & Number Theory
سال: 2018
ISSN: 1944-7833,1937-0652
DOI: 10.2140/ant.2018.12.2005